Dynamic labeling schemes for ordered XML based on type information

نویسندگان

  • Damien K. Fisher
  • Franky Lam
  • William M. Shui
  • Raymond K. Wong
چکیده

With the increasing popularity of XML, there arises the need for managing and querying information in this form. Several query languages, such as XQuery, have been proposed which return their results in document order. However, most recent efforts focused on query optimization have either disregarded order or proposed static schemes in which updates are not handled efficiently. Some dynamic labelling schemes have been proposed but they do not consider type information that is usually available with the XML documents or maintained by the database system. This paper presents theoretically sound algorithms for maintaining the well-known region algebra labeling schemes, which can take advantage of type information, often present in XML documents.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Prefix Labeling Scheme: A Binary String Approach for Dynamic Ordered XML

A number of labeling schemes have been designed to facilitate the query of XML, based on which the ancestor-descendant relationship between any two nodes can be determined quickly. Another important feature of XML is that the elements in XML are intrinsically ordered. However the label update cost is high based on the present labeling schemes. They have to re-label the existing nodes or re-calc...

متن کامل

L-Tree: A Dynamic Labeling Structure for Ordered XML Data

With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses on efficient XML query processing, XML databases also need to support efficient updates. To speed up query processing, various labeling schemes have been proposed. However, the vast majority of these schemes have poo...

متن کامل

A Concise Labeling Scheme for XML Data

In this paper, we look at the problem of assigning labels to nodes of a dynamic XML tree such that the labels encode all ancestor-descendant relationships between the nodes and the document-order between the nodes. Such labeling facilitates efficient XML query processing. A number of labeling schemes have been designed for this task. These schemes can be broadly classified into (1) Static Label...

متن کامل

A Two-Dimension XML Encoding Method based on Variable Length Binary Code

Recently, the researchers have proposed a number of labeling schemes. In these labeling schemes, the approach which can extract structural information between nodes and process query efficiently is more outstanding. However, most of these labeling schemes do not well support update operations. To achieve update-friendly operations, some of the methods keep intervals between labeling numbers, bu...

متن کامل

Efficient Label Encoding for Range-Based Dynamic XML Labeling Schemes

Designing dynamic labeling schemes to support order-sensitive queries for XML documents has been recognized as an important research problem. In this work, we consider the problem of making range-based XML labeling schemes dynamic through the process of encoding. We point out the problems of existing encoding algorithms which include computational and memory inefficiencies. We introduce a novel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006